A characterization of the Language Invariant families satisfying Spectrum Exchangeability in Polyadic Inductive Logic
نویسندگان
چکیده
A necessary and sufficient condition in terms of a de Finetti style representation is given for a probability function in Polyadic Inductive Logic to satisfy being part of a Language Invariant family satisfying Spectrum Exchangeability. This theorem is then considered in relation to the unary Carnap and Nix-Paris Continua.
منابع مشابه
The principle of signature exchangeability
We investigate the notion of a signature in Polyadic Inductive Logic and study the probability functions satisfying the Principle of Signature Exchangeability. In the binary case, we prove a representation theorem for such functions and show that they satisfy a binary version of the Principle of Instantial Relevance. We discuss polyadic versions of the Principle of Instantial Relevance and John...
متن کاملThe Theory of spectrum Exchangeability
Spectrum Exchangeability, Sx, is an irrelevance principle of Pure Inductive Logic, and arguably the most natural (but not the only) extension of Atom Exchangeability to polyadic languages. It has been shown1 that all probability functions which satisfy Sx are comprised of a mixture of two essential types of probability functions; heterogeneous and homogeneous functions. We determine the theory ...
متن کاملLanguage Invariance and Spectrum Exchangeability in Inductive Logic
A sufficient condition is given for a probability function in Inductive Logic (with relations of all arities) satisfying spectrum exchangeability to additionally satisfy Language Invariance. This condition is shown to also be necessary in the case of homogeneous probability functions.
متن کاملElementary canonical formulae: extending Sahlqvist's theorem
We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of mi...
متن کاملAlgorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
In Conradie, Goranko, and Vakarelov (2006, Logical Methods in Computer Science, 2) we introduced a new algorithm, SQEMA, for computing first-order equivalents and proving the canonicity of modal formulae of the basic modal language. Here we extend SQEMA, first to arbitrary and reversive polyadic modal languages, and then to hybrid polyadic languages too. We present the algorithm, illustrate it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 161 شماره
صفحات -
تاریخ انتشار 2010